Optimal Probabilistic Generation of XML Documents
نویسندگان
چکیده
منابع مشابه
Compression of Probabilistic XML Documents
Probabilistic XML (PXML) files resulting from data integration can become extremely large, which is undesired. For XML there are several techniques available to compress the document and since probabilistic XML is in fact (a special form of) XML, it might benefit from these methods even more. In this research we search for compression mechanisms that are available for XML and implement one of t...
متن کاملEdit Distance between XML and Probabilistic XML Documents
Probabilistic XML is a hierarchical data model capturing uncertainty of both value and structure. The ability to compute the similarity between an XML document and a probabilistic XML document is a building block of many applications involving querying, comparison, alignment and classification, for instance. The new challenge in efficiently computing such similarity is the multiplicity of the p...
متن کاملAutomation of XML Documents Translators Generation
Large network environments, such as enterprise intranet and Internet have moved the center stage in the field of software engineering. In this new environment the communication platform is no longer a problem, but the Information Interchange Format (IIF) itself as become to be the new barrier of communication. This paper presents the formalization of the process of automatic generation of XML t...
متن کاملA Probabilistic Learning Method for XML Annotation of Documents
We consider the problem of semantic annotation of semi-structured documents according to a target XML schema. The task is to annotate a document in a tree-like manner where the annotation tree is an instance of a tree class defined by DTD or W3C XML Schema descriptions. In the probabilistic setting, we cope with the tree annotation problem as a generalized probabilistic context-free parsing of ...
متن کاملOptimal Probabilistic Generators for XML Corpora
We study the problem of, given a corpus of XML documents and its schema, finding an optimal probabilistic model (optimality meaning maximizing the likelihood of the corpus to be generated). We present an efficient algorithm for finding the best probabilistic model, in absence of constraints. We further study the problem in presence of integrity constraints (key, inclusion, and domain constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9581-5